Complexity Measure for Block Diagrams
نویسندگان
چکیده
The concept of complexity has been widely studied in the last years in several different areas. Although many writers on the subject understand qualitatively similar things by the term ”complexity”, a transition from this qualitative understanding to a quantitative approach would be highly desirable and necessary. The lack of understanding in this area has hindered planners in deciding how much integration is beneficial and beyond which point integration is actually detrimental to system performance, since correct decisions are difficult to make due to high system complexity. The objective of this paper is to present a method to quantify the static complexity of a block diagram in a way that can be useful for process control structure selection. The method is applied in several examples. The importance of this evaluation is to help to produce good control structures with the smallest possible complexity due to the fact that the costs of implementation increase in large complex systems. Once determined a way to quantify it, it is possible to minimize the complexity of this system keeping the same control performance.
منابع مشابه
New Fixed Point Attacks on GOST2 Block Cipher
GOST block cipher designed in the 1970s and published in 1989 as the Soviet and Russian standard GOST 28147-89. In order to enhance the security of GOST block cipher after proposing various attacks on it, designers published a modified version of GOST, namely GOST2, in 2015 which has a new key schedule and explicit choice for S-boxes. In this paper, by using three exactly identical portions of ...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملThe organization of intrinsic computation: complexity-entropy diagrams and the diversity of natural information processing.
Intrinsic computation refers to how dynamical systems store, structure, and transform historical and spatial information. By graphing a measure of structural complexity against a measure of randomness, complexity-entropy diagrams display the different kinds of intrinsic computation across an entire class of systems. Here, we use complexity-entropy diagrams to analyze intrinsic computation in a ...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملMeasurement of Complexity and Comprehension of a Program Through a Cognitive Approach
The inherent complexity of the software systems creates problems in the software engineering industry. Numerous techniques have been designed to comprehend the fundamental characteristics of software systems. To understand the software, it is necessary to know about the complexity level of the source code. Cognitive informatics perform an important role for better understanding the complexity o...
متن کامل